Bisimulation for Single-Agent Plausibility Models

نویسندگان

  • Mikkel Birkegaard Andersen
  • Thomas Bolander
  • Hans van Ditmarsch
  • Martin Holm Jensen
چکیده

Epistemic plausibility models are Kripke models agents use to reason about the knowledge and beliefs of themselves and each other. Restricting ourselves to the single-agent case, we determine when such models are indistinguishable in the logical language containing conditional belief, i.e., we define a proper notion of bisimulation, and prove that bisimulation corresponds to logical equivalence on image-finite models. We relate our results to other epistemic notions, such as safe belief and degrees of belief. Our results imply that there are only finitely many non-bisimilar single-agent epistemic plausibility models on a finite set of propositions. This gives decidability for single-agent epistemic plausibility planning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bisimulation for Conditional Modalities

We give a general definition of bisimulation for conditional modalities interpreted on selection functions and prove the correspondence between bisimilarity and modal equivalence. We describe how this framework specializes to unary modalities and further investigate the operators and semantics to which these results apply. First, we show that our models encompass both Grove’s sphere models and ...

متن کامل

Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe bel...

متن کامل

Some remarks on the model theory of epistemic plausibility models

Traditional epistemic logic can be seen as a particular branch of modal logic. Its semantics is defined in terms of Kripke models, and philosophical principles about knowledge (e.g. factivity: Kφ→ φ) are shown to correspond to properties of the epistemic accessibility relation (e.g. reflexivity). By adding another (doxastic) accessibility relation, also belief can be treated in this framework. ...

متن کامل

Epistemic Probability Logic Simplified

We propose a simplified logic for reasoning about (multi-agent) epistemic probability models, and for epistemic probabilistic model checking. Epistemic probability models are multi-agent Kripke models that assign to each agent an equivalence relation on worlds, together with a function from worlds to positive rationals (a lottery). The difference with the usual approach is that probability is l...

متن کامل

On the Definability of Simulability and Bisimilarity by Finite Epistemic Models

We explore when finite epistemic models are definable up to simulability or bisimulation, either over the basic multi-agent epistemic language L or over its extension L with common knowledge operators. Our negative results are that: simulability is not definable in general in L , and finite epistemic states (i.e., pointed models) are not definable up to bisimulation in L. Our positive results a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013